Toric Ideals of Lattice Path Matroids and Polymatroids

نویسنده

  • Jay Schweig
چکیده

We show that the toric ideal of a lattice path polymatroid is generated by quadrics corresponding to symmetric exchanges, and give a monomial order under which these quadrics form a Gröbner basis. We then obtain an analogous result for lattice path matroids.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the h-Vector of a Lattice Path Matroid

Stanley has conjectured that the h-vector of a matroid complex is a pure Mvector. We prove a strengthening of this conjecture for lattice path matroids by constructing a corresponding family of discrete polymatroids.

متن کامل

Neighbor Systems and the Greedy Algorithm ( Extended

A neighbor system, introduced in this paper, is a collection of integral vectors in R with some special structure. Such collections (slightly) generalize jump systems, which, in turn, generalize integral bisubmodular polyhedra, integral polymatroids, delta-matroids, matroids, and other structures. We show that neighbor systems provide a systematic and simple way to characterize these structures...

متن کامل

The toric ideal of a graphic matroid is generated by quadrics

Describing minimal generating sets of toric ideals is a well-studied and difficult problem. Neil White conjectured in 1980 that the toric ideal associated to a matroid is generated by quadrics corresponding to single element symmetric exchanges. We give a combinatorial proof of White’s conjecture for graphic matroids.

متن کامل

Matchings in simplicial complexes, circuits and toric varieties

Using a generalized notion of matching in a simplicial complex and circuits of vector configurations, we compute lower bounds for the minimum number of generators, the binomial arithmetical rank and the A-homogeneous arithmetical rank of a lattice ideal. Prime lattice ideals are toric ideals, i.e. the defining ideals of toric varieties. © 2006 Elsevier Inc. All rights reserved.

متن کامل

Toric Codes and Lattice Ideals

Let X be a complete simplicial toric variety over a finite field Fq with homogeneous coordinate ring S = Fq[x1, . . . , xr] and split torus TX ∼= (Fq). We prove that vanishing ideal of a subset Y of the torus TX is a lattice ideal if and only if Y is a subgroup. We show that these subgroups are exactly those subsets that are parameterized by Laurents monomials. We give an algorithm for determin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010